0.04/0.14	% Problem    : Vampire---4.8_15998 : TPTP v0.0.0. Released v0.0.0.
0.14/0.15	% Command    : run_E %s %d THM
0.14/0.36	% Computer : n002.cluster.edu
0.14/0.36	% Model    : x86_64 x86_64
0.14/0.36	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.36	% Memory   : 8042.1875MB
0.14/0.36	% OS       : Linux 3.10.0-693.el7.x86_64
0.14/0.36	% CPULimit   : 1440
0.14/0.36	% WCLimit    : 180
0.14/0.36	% DateTime   : Mon Jul  3 13:25:07 EDT 2023
0.14/0.36	% CPUTime    : 
0.21/0.50	Running higher-order theorem provingRunning: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.nsofo8qTgI/Vampire---4.8_15998
0.21/0.50	# Version: 3.1pre001-ho
0.63/0.58	# Preprocessing class: HSLSSMSSMLLNHSN.
0.63/0.58	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.63/0.58	# Starting almost_fo_3 with 900s (5) cores
0.63/0.58	# Starting sh10 with 180s (1) cores
0.63/0.58	# Starting new_ho_16 with 180s (1) cores
0.63/0.58	# Starting post_as_ho11 with 180s (1) cores
0.63/0.58	# new_ho_16 with pid 16336 completed with status 8
0.63/0.58	# almost_fo_3 with pid 16334 completed with status 0
0.63/0.58	# Result found by almost_fo_3
0.63/0.58	# Preprocessing class: HSLSSMSSMLLNHSN.
0.63/0.58	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.63/0.58	# Starting almost_fo_3 with 900s (5) cores
0.63/0.58	# No SInE strategy applied
0.63/0.58	# Search class: HGUNS-FSLF32-SHSSMMBN
0.63/0.58	# Scheduled 6 strats onto 5 cores with 900 seconds (900 total)
0.63/0.58	# Starting new_ho_10 with 487s (1) cores
0.63/0.58	# Starting almost_fo_3 with 91s (1) cores
0.63/0.58	# Starting ho_unfolding_6 with 82s (1) cores
0.63/0.58	# Starting sh4l with 82s (1) cores
0.63/0.58	# Starting ehoh_best_nonlift_rwall with 82s (1) cores
0.63/0.58	# almost_fo_3 with pid 16347 completed with status 0
0.63/0.58	# Result found by almost_fo_3
0.63/0.58	# Preprocessing class: HSLSSMSSMLLNHSN.
0.63/0.58	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.63/0.58	# Starting almost_fo_3 with 900s (5) cores
0.63/0.58	# No SInE strategy applied
0.63/0.58	# Search class: HGUNS-FSLF32-SHSSMMBN
0.63/0.58	# Scheduled 6 strats onto 5 cores with 900 seconds (900 total)
0.63/0.58	# Starting new_ho_10 with 487s (1) cores
0.63/0.58	# Starting almost_fo_3 with 91s (1) cores
0.63/0.58	# Preprocessing time       : 0.004 s
0.63/0.58	# Presaturation interreduction done
0.63/0.58	
0.63/0.58	# Proof found!
0.63/0.58	# SZS status Theorem
0.63/0.58	# SZS output start CNFRefutation
0.63/0.58	thf(decl_24, type, mnot: ($i > $o) > $i > $o).
0.63/0.58	thf(decl_25, type, mor: ($i > $o) > ($i > $o) > $i > $o).
0.63/0.58	thf(decl_27, type, mimplies: ($i > $o) > ($i > $o) > $i > $o).
0.63/0.58	thf(decl_31, type, mforall_ind: (mu > $i > $o) > $i > $o).
0.63/0.58	thf(decl_32, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o).
0.63/0.58	thf(decl_33, type, mexists_ind: (mu > $i > $o) > $i > $o).
0.63/0.58	thf(decl_37, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
0.63/0.58	thf(decl_49, type, mvalid: ($i > $o) > $o).
0.63/0.58	thf(decl_54, type, r2: $i > $i > $o).
0.63/0.58	thf(decl_56, type, r4: $i > $i > $o).
0.63/0.58	thf(decl_58, type, john: mu).
0.63/0.58	thf(decl_62, type, good_in_maths: mu > $i > $o).
0.63/0.58	thf(decl_63, type, maths_teacher: mu > $i > $o).
0.63/0.58	thf(decl_80, type, esk13_2: $i > ($i > $o) > $i).
0.63/0.58	thf(decl_125, type, esk58_0: $i).
0.63/0.58	thf(decl_126, type, esk59_1: mu > $i).
0.63/0.58	thf(mimplies, axiom, ((mimplies)=(^[X6:$i > $o, X7:$i > $o]:(mor @ (mnot @ X6) @ X7))), file('/export/starexec/sandbox/tmp/tmp.nsofo8qTgI/Vampire---4.8_15998', mimplies)).
0.63/0.58	thf(mnot, axiom, ((mnot)=(^[X6:$i > $o, X3:$i]:(~((X6 @ X3))))), file('/export/starexec/sandbox/tmp/tmp.nsofo8qTgI/Vampire---4.8_15998', mnot)).
0.63/0.58	thf(mor, axiom, ((mor)=(^[X6:$i > $o, X7:$i > $o, X3:$i]:(((X6 @ X3)|(X7 @ X3))))), file('/export/starexec/sandbox/tmp/tmp.nsofo8qTgI/Vampire---4.8_15998', mor)).
0.63/0.58	thf(mforall_ind, axiom, ((mforall_ind)=(^[X8:mu > $i > $o, X3:$i]:(![X1:mu]:((X8 @ X1 @ X3))))), file('/export/starexec/sandbox/tmp/tmp.nsofo8qTgI/Vampire---4.8_15998', mforall_ind)).
0.63/0.58	thf(mbox, axiom, ((mbox)=(^[X13:$i > $i > $o, X6:$i > $o, X3:$i]:(![X14:$i]:((~((X13 @ X3 @ X14))|(X6 @ X14)))))), file('/export/starexec/sandbox/tmp/tmp.nsofo8qTgI/Vampire---4.8_15998', mbox)).
0.63/0.58	thf(mvalid, axiom, ((mvalid)=(^[X6:$i > $o]:(![X3:$i]:((X6 @ X3))))), file('/export/starexec/sandbox/tmp/tmp.nsofo8qTgI/Vampire---4.8_15998', mvalid)).
0.63/0.58	thf(mexists_ind, axiom, ((mexists_ind)=(^[X11:mu > $i > $o]:(mnot @ (mforall_ind @ (^[X1:mu]:(mnot @ (X11 @ X1))))))), file('/export/starexec/sandbox/tmp/tmp.nsofo8qTgI/Vampire---4.8_15998', mexists_ind)).
0.63/0.58	thf(mforall_prop, axiom, ((mforall_prop)=(^[X9:($i > $o) > $i > $o, X3:$i]:(![X10:$i > $o]:((X9 @ X10 @ X3))))), file('/export/starexec/sandbox/tmp/tmp.nsofo8qTgI/Vampire---4.8_15998', mforall_prop)).
0.63/0.58	thf(axiom_r1, axiom, (mvalid @ (mforall_ind @ (^[X1:mu]:(mimplies @ (maths_teacher @ X1) @ (mbox @ r4 @ (good_in_maths @ X1)))))), file('/export/starexec/sandbox/tmp/tmp.nsofo8qTgI/Vampire---4.8_15998', axiom_r1)).
0.63/0.58	thf(axiom_a6, axiom, (mvalid @ (maths_teacher @ john)), file('/export/starexec/sandbox/tmp/tmp.nsofo8qTgI/Vampire---4.8_15998', axiom_a6)).
0.63/0.58	thf(axiom_I_for_r4_r2, axiom, (mvalid @ (mforall_prop @ (^[X6:$i > $o]:(mimplies @ (mbox @ r4 @ X6) @ (mbox @ r2 @ X6))))), file('/export/starexec/sandbox/tmp/tmp.nsofo8qTgI/Vampire---4.8_15998', axiom_I_for_r4_r2)).
0.63/0.58	thf(conj, conjecture, (mvalid @ (mexists_ind @ (^[X1:mu]:(mbox @ r2 @ (good_in_maths @ X1))))), file('/export/starexec/sandbox/tmp/tmp.nsofo8qTgI/Vampire---4.8_15998', conj)).
0.63/0.58	thf(c_0_12, plain, ((mimplies)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o, Z2:$i]:(((~((Z0 @ Z2)))|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mimplies])).
0.63/0.58	thf(c_0_13, plain, ((mnot)=(^[Z0/* 19 */:$i > $o, Z1:$i]:(~((Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[mnot])).
0.63/0.58	thf(c_0_14, plain, ((mor)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o, Z2:$i]:(((Z0 @ Z2)|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mor])).
0.63/0.58	thf(c_0_15, plain, ((mimplies)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o, Z2:$i]:(((~((Z0 @ Z2)))|(Z1 @ Z2))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_12, c_0_13]), c_0_14])).
0.63/0.58	thf(c_0_16, plain, ((mforall_ind)=(^[Z0/* 19 */:mu > $i > $o, Z1:$i]:(![X1:mu]:((Z0 @ X1 @ Z1))))), inference(fof_simplification,[status(thm)],[mforall_ind])).
0.63/0.58	thf(c_0_17, plain, ((mbox)=(^[Z0/* 19 */:$i > $i > $o, Z1:$i > $o, Z2:$i]:(![X14:$i]:((~((Z0 @ Z2 @ X14))|(Z1 @ X14)))))), inference(fof_simplification,[status(thm)],[mbox])).
0.63/0.58	thf(c_0_18, plain, ((mvalid)=(^[Z0/* 6 */:$i > $o]:(![X3:$i]:((Z0 @ X3))))), inference(fof_simplification,[status(thm)],[mvalid])).
0.63/0.58	thf(c_0_19, plain, ((mexists_ind)=(^[Z0/* 19 */:mu > $i > $o, Z1:$i]:(~((![X18:mu]:((~((Z0 @ X18 @ Z1))))))))), inference(fof_simplification,[status(thm)],[mexists_ind])).
0.63/0.58	thf(c_0_20, plain, ((mforall_prop)=(^[Z0/* 19 */:($i > $o) > $i > $o, Z1:$i]:(![X10:$i > $o]:((Z0 @ X10 @ Z1))))), inference(fof_simplification,[status(thm)],[mforall_prop])).
0.63/0.58	thf(c_0_21, plain, ![X94:$i, X93:mu]:((~(maths_teacher @ X93 @ X94)|![X92:$i]:((~(r4 @ X94 @ X92)|(good_in_maths @ X93 @ X92))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_r1]), c_0_15]), c_0_16]), c_0_17]), c_0_18])])).
0.63/0.58	thf(c_0_22, plain, ![X58:$i]:((maths_teacher @ john @ X58)), inference(apply_def,[status(thm)],[axiom_a6, c_0_18])).
0.63/0.58	thf(c_0_23, plain, ((mexists_ind)=(^[Z0/* 19 */:mu > $i > $o, Z1:$i]:(~((![X18:mu]:((~((Z0 @ X18 @ Z1))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_19, c_0_13]), c_0_16])).
0.63/0.58	thf(c_0_24, plain, ![X78:$i, X77:$i > $o]:((~(![X75:$i]:((~(r4 @ X78 @ X75)|(X77 @ X75))))|![X76:$i]:((~(r2 @ X78 @ X76)|(X77 @ X76))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_I_for_r4_r2]), c_0_15]), c_0_20]), c_0_17]), c_0_18])])).
0.63/0.58	thf(c_0_25, plain, ![X384:$i, X385:mu, X386:$i]:((~(maths_teacher @ X385 @ X384)|(~(r4 @ X384 @ X386)|(good_in_maths @ X385 @ X386)))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_21])])).
0.63/0.58	thf(c_0_26, plain, ![X350:$i]:((maths_teacher @ john @ X350)), inference(variable_rename,[status(thm)],[c_0_22])).
0.63/0.58	thf(c_0_27, negated_conjecture, ~(![X266:$i]:(~(![X265:mu]:(~(![X264:$i]:((~(r2 @ X266 @ X264)|(good_in_maths @ X265 @ X264)))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj])]), c_0_23]), c_0_17]), c_0_18])])).
0.63/0.58	thf(c_0_28, plain, ![X367:$i, X368:$i > $o, X370:$i]:((((r4 @ X367 @ (esk13_2 @ X367 @ X368))|(~(r2 @ X367 @ X370)|(X368 @ X370)))&(~(X368 @ (esk13_2 @ X367 @ X368))|(~(r2 @ X367 @ X370)|(X368 @ X370))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])])])])).
0.63/0.58	thf(c_0_29, plain, ![X3:$i, X1:mu, X14:$i]:(((good_in_maths @ X1 @ X14)|~((maths_teacher @ X1 @ X3))|~((r4 @ X3 @ X14)))), inference(split_conjunct,[status(thm)],[c_0_25])).
0.63/0.58	thf(c_0_30, plain, ![X3:$i]:((maths_teacher @ john @ X3)), inference(split_conjunct,[status(thm)],[c_0_26])).
0.63/0.58	thf(c_0_31, negated_conjecture, ![X557:mu]:(((r2 @ esk58_0 @ (esk59_1 @ X557))&~(good_in_maths @ X557 @ (esk59_1 @ X557)))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_27])])])).
0.63/0.58	thf(c_0_32, plain, ![X4:$i > $o, X3:$i, X14:$i]:(((X4 @ X14)|~((X4 @ (esk13_2 @ X3 @ X4)))|~((r2 @ X3 @ X14)))), inference(split_conjunct,[status(thm)],[c_0_28])).
0.63/0.58	thf(c_0_33, plain, ![X14:$i, X3:$i]:(((good_in_maths @ john @ X3)|~((r4 @ X14 @ X3)))), inference(spm,[status(thm)],[c_0_29, c_0_30])).
0.63/0.58	thf(c_0_34, negated_conjecture, ![X1:mu]:(~((good_in_maths @ X1 @ (esk59_1 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_31])).
0.63/0.58	thf(c_0_35, plain, ![X14:$i, X15:$i, X3:$i]:(((good_in_maths @ john @ X3)|~((r4 @ X14 @ (esk13_2 @ X15 @ (good_in_maths @ john))))|~((r2 @ X15 @ X3)))), inference(spm,[status(thm)],[c_0_32, c_0_33])).
0.63/0.58	thf(c_0_36, plain, ![X4:$i > $o, X3:$i, X14:$i]:(((r4 @ X3 @ (esk13_2 @ X3 @ X4))|(X4 @ X14)|~((r2 @ X3 @ X14)))), inference(split_conjunct,[status(thm)],[c_0_28])).
0.63/0.58	thf(c_0_37, negated_conjecture, ![X1:mu]:((r2 @ esk58_0 @ (esk59_1 @ X1))), inference(split_conjunct,[status(thm)],[c_0_31])).
0.63/0.58	thf(c_0_38, negated_conjecture, ![X3:$i, X14:$i]:((~((r4 @ X3 @ (esk13_2 @ X14 @ (good_in_maths @ john))))|~((r2 @ X14 @ (esk59_1 @ john))))), inference(spm,[status(thm)],[c_0_34, c_0_35])).
0.63/0.58	thf(c_0_39, negated_conjecture, ![X4:$i > $o, X1:mu]:(((r4 @ esk58_0 @ (esk13_2 @ esk58_0 @ X4))|(X4 @ (esk59_1 @ X1)))), inference(spm,[status(thm)],[c_0_36, c_0_37])).
0.63/0.58	thf(c_0_40, negated_conjecture, ![X1:mu]:((good_in_maths @ john @ (esk59_1 @ X1))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38, c_0_39]), c_0_37])])).
0.63/0.58	thf(c_0_41, negated_conjecture, ($false), inference(spm,[status(thm)],[c_0_34, c_0_40]), ['proof']).
0.63/0.58	# SZS output end CNFRefutation
0.63/0.58	# Parsed axioms                        : 145
0.63/0.58	# Removed by relevancy pruning/SinE    : 0
0.63/0.58	# Initial clauses                      : 186
0.63/0.58	# Removed in clause preprocessing      : 47
0.63/0.58	# Initial clauses in saturation        : 139
0.63/0.58	# Processed clauses                    : 250
0.63/0.58	# ...of these trivial                  : 0
0.63/0.58	# ...subsumed                          : 4
0.63/0.58	# ...remaining for further processing  : 246
0.63/0.58	# Other redundant clauses eliminated   : 0
0.63/0.58	# Clauses deleted for lack of memory   : 0
0.63/0.58	# Backward-subsumed                    : 2
0.63/0.58	# Backward-rewritten                   : 2
0.63/0.58	# Generated clauses                    : 676
0.63/0.58	# ...of the previous two non-redundant : 637
0.63/0.58	# ...aggressively subsumed             : 0
0.63/0.58	# Contextual simplify-reflections      : 0
0.63/0.58	# Paramodulations                      : 672
0.63/0.58	# Factorizations                       : 4
0.63/0.58	# NegExts                              : 0
0.63/0.58	# Equation resolutions                 : 0
0.63/0.58	# Total rewrite steps                  : 41
0.63/0.58	# Propositional unsat checks           : 0
0.63/0.58	#    Propositional check models        : 0
0.63/0.58	#    Propositional check unsatisfiable : 0
0.63/0.58	#    Propositional clauses             : 0
0.63/0.58	#    Propositional clauses after purity: 0
0.63/0.58	#    Propositional unsat core size     : 0
0.63/0.58	#    Propositional preprocessing time  : 0.000
0.63/0.58	#    Propositional encoding time       : 0.000
0.63/0.58	#    Propositional solver time         : 0.000
0.63/0.58	#    Success case prop preproc time    : 0.000
0.63/0.58	#    Success case prop encoding time   : 0.000
0.63/0.58	#    Success case prop solver time     : 0.000
0.63/0.58	# Current number of processed clauses  : 103
0.63/0.58	#    Positive orientable unit clauses  : 13
0.63/0.58	#    Positive unorientable unit clauses: 0
0.63/0.58	#    Negative unit clauses             : 2
0.63/0.58	#    Non-unit-clauses                  : 88
0.63/0.58	# Current number of unprocessed clauses: 658
0.63/0.58	# ...number of literals in the above   : 2514
0.63/0.58	# Current number of archived formulas  : 0
0.63/0.58	# Current number of archived clauses   : 143
0.63/0.58	# Clause-clause subsumption calls (NU) : 2514
0.63/0.58	# Rec. Clause-clause subsumption calls : 1486
0.63/0.58	# Non-unit clause-clause subsumptions  : 4
0.63/0.58	# Unit Clause-clause subsumption calls : 39
0.63/0.58	# Rewrite failures with RHS unbound    : 0
0.63/0.58	# BW rewrite match attempts            : 4
0.63/0.58	# BW rewrite match successes           : 4
0.63/0.58	# Condensation attempts                : 0
0.63/0.58	# Condensation successes               : 0
0.63/0.58	# Termbank termtop insertions          : 36793
0.63/0.58	
0.63/0.58	# -------------------------------------------------
0.63/0.58	# User time                : 0.061 s
0.63/0.58	# System time              : 0.012 s
0.63/0.58	# Total time               : 0.073 s
0.63/0.58	# Maximum resident set size: 4184 pages
0.63/0.59	
0.63/0.59	# -------------------------------------------------
0.63/0.59	# User time                : 0.248 s
0.63/0.59	# System time              : 0.055 s
0.63/0.59	# Total time               : 0.304 s
0.63/0.59	# Maximum resident set size: 1864 pages
0.63/0.59	% E---3.1 exiting
0.63/0.59	EOF